Determinancy → (observation equivalence = trace equivalence)
نویسندگان
چکیده
منابع مشابه
Determinacy - (Observation Equivalence = Trace Equivalence)
If an experiment s is conducted on a parallel process p, then, in general, different processes may result from the experiment, due to the nondeterministic behaviour of p (in the notation of Milner (1980): p ~ p' for different p'). Process p is called determinate if the resulting processes are all equivalent (i.e., if p A=> p' and p ~ p", then p' and p" are equivalent). This means that, although...
متن کاملInfinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. We discuss the difficulties with traditional approaches, where divergence is bottom or where a term denotes a function from a set of environments. We see that making forcing explicit, in the manner of game semantics, al...
متن کاملSimplified Coalgebraic Trace Equivalence
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called lineartime/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity to coarse-grained ones such as trace equivalence. The theory of concurrent systems at large has benefited from developments in coalgebra, which has enabled un...
متن کاملModal Observation Equivalence of Processes
This paper shows that many simulation equivalences over processes can be characterised by a single parameterised modal logic formula. For many equivalences there is a parameterised modal logic formula f(t) such that for every pair of processes P and Q, P Q if and only if P j= f(Q). For any speci c P the formula f(P ) becomes a x point formula of the normal modal logic K . Strong bisimulation eq...
متن کاملTrace and Testing Equivalence on Asynchronous Processes
We study trace and may-testing equivalences in the asynchronous versions of CCS and-calculus. We start from the operational deenition of the may-testing preorder and provide for it nitary and fully abstract trace-based characterizations, along with a complete in-equational proof system. We also touch upon two variants of this theory, by rst considering a more demanding equivalence notion (must-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1985
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90028-3